Linearly constrained positive definite completions
نویسندگان
چکیده
منابع مشابه
Linearly Constrained Problems
The aim of this paper is to study the convergence properties of the gradient projection method and to apply these results to algorithms for linearly constrained problems. The main convergence result is obtained by defining a projected gradient, and proving that the gradient projection method forces the sequence of projected gradients to zero. A consequence of this result is that if the gradient...
متن کاملPositive Definite Rational Kernels
Kernel methods are widely used in statistical learning techniques. We recently introduced a general kernel framework based on weighted transducers or rational relations, rational kernels, to extend kernel methods to the analysis of variable-length sequences or more generally weighted automata. These kernels are efficient to compute and have been successfully used in applications such as spoken-...
متن کاملPositive Definite and Semi-definite Splitting Methods for Non-hermitian Positive Definite Linear Systems
In this paper, we further generalize the technique for constructing the normal (or positive definite) and skew-Hermitian splitting iteration method for solving large sparse nonHermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting (PPS) methods, and prove th...
متن کاملCertain Positive-definite Kernels
In one way or another, the extension of the standard Brownian motion process {B¡: t e [0,oo)} to a (Gaussian) random field {Bt: t € R+} involves a proof of the positive semi-definiteness of the kernel used to generalize p(s, 1) = cov(Bs,B¡) = s A t to multidimensional time. Simple direct analytical proofs are provided here for the cases of (i) the Levy multiparameter Brownian motion, (ii) the C...
متن کاملLarge-scale linearly constrained optimization
An algorithm for solving large-scale nonlinear' programs with linear constraints is presented. The method combines efficient sparse-matrix techniques as in the revised simplex method with stable quasi-Newton methods for handling the nonlinearities. A general-purpose production code (MINOS) is described, along with computational experience on a wide variety of problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1991
ISSN: 0024-3795
DOI: 10.1016/0024-3795(91)90169-w